package ds.tree;


public class Ancestors {
	private static class TreeNode{
		int value;
		TreeNode left = null;
		TreeNode right = null;
		
		TreeNode(int val){
			this.value = val;
		}
		
		public String toString(){
			return String.valueOf(value);
		}
	}

	private static TreeNode tree(){
		TreeNode A = new TreeNode(1);
		TreeNode B = new TreeNode(2);
		TreeNode C = new TreeNode(3);
		TreeNode D = new TreeNode(4);
		TreeNode E = new TreeNode(5);
		TreeNode F = new TreeNode(6);
		TreeNode G = new TreeNode(7);
		
		A.left = B;
		A.right = C;
		B.left = D;
		B.right = E;
		C.left = F;
		C.right = G;
		
		return A;
	}
	public boolean ancestors(TreeNode node, TreeNode key){
		if(node == null){
			return false;
		}
		if(node.value == key.value){
			return true;
		}
		
		if(ancestors(node.left,key) || ancestors(node.right,key)){
			System.out.print( node+" ");
			return true;
		}
		
		return false;
	}
	public static void main(String[] args) {
		Ancestors ancestors = new Ancestors();
		ancestors.ancestors(tree(), new TreeNode(6));
	}

}
